. C O ] 1 0 Ja n 20 09 A Characterization On Potentially K 2 , 5 - graphic Sequences ∗
نویسنده
چکیده
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K2,5-graphic sequences. This characterization implies a theorem due to Yin et al. [15].
منابع مشابه
1 0 Ja n 20 09 A Characterization On Potentially K 6 − C 4 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K6 − C4-graphic sequences. This characterization implies a theorem due to Hu and Lai [7].
متن کاملar X iv : 0 90 1 . 13 57 v 2 [ m at h . C O ] 1 0 Ju l 2 00 9 A Characterization On Potentially K 2 , 5 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km − H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize potentially K2,5-graphic sequences. This characterization implies a special case of a theorem due to ...
متن کامل. C O ] 3 0 Se p 20 09 Potentially K m − G - graphical Sequences : A Survey ∗
The set of all non-increasing nonnegative integers sequence π = (d(v1), d(v2), ..., d(vn)) is denoted by NSn. A sequence π ∈ NSn is said to be graphic if it is the degree sequence of a simple graph G on n vertices, and such a graph G is called a realization of π. The set of all graphic sequences in NSn is denoted by GSn. A graphical sequence π is potentially H-graphical if there is a realizatio...
متن کاملar X iv : 0 81 2 . 48 61 v 2 [ m at h . C O ] 8 J ul 2 00 9 On Potentially K 6 − C 5 graphic Sequences ∗
For given a graph H , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially K6 − C5 -graphic sequences .
متن کاملar X iv : m at h / 07 02 24 5 v 2 [ m at h . C O ] 1 7 Se p 20 07 On Potentially K 5 − E 3 - graphic Sequences ∗
Let Km −H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. In this paper, we characterize the potentially K5 − P3, K5 − A3, K5 −K3 and K5 − K1,3-graphic sequences where A3 is P2 ∪ K2. Moreover, we also characterize the potentially K5 − 2K2-graphic sequences where pK2 is the matching consisted of p edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009